For each core count (4, 8, or 16), the set of all graphs is saved as a single PDF.

In addition, each graph is saved as an individual PDF.  The name of each file gives the scenario.
Core Count \mu h=0 Mij distribution task util range RSA .pdf

For example the file

4 Cores 0.2, h=0 , expo Task Util. ~ U(0, 0.4) 1.32.pdf

Shows schedulability results
--using four cores
--with \mu=0.2 (optimistic)
--h=0 (no harmful tasks)
--exponential Mij distribution
--task utilizations from the range (0, 0.4), e.g. light
--RSA 1.32.

The three CSV files collectively list all scenarios and summarize the results for each.

The file "srt_schedTests_Apr22-bin0,1-samples100.csv" contains information for all scenarios,
but will only produce low resolution graphs.

The file "srt_schedTests_Apr28-bin0,2-samples500.csv" contains information for 8 and 16 core scenarios,
and will produce moderate resolution graphs.

The file "srt_schedTests_Apr22-bin0,1-samples1000.csv" contains information for 4 and 8 core scenarios,
and will produce high resolution graphs.

In the "score_distro" column, a 0 indicates that the fixed distribution was used
and a 1 indicates the exponential distribution was used.

In the column "algo", the algorithms are identified as follows:
--1: Oblivious Scheduling
--2: Greedy-Thread
--3: Greedy-Physical
--4: Greedy-Mixed

The column best_rsa contains a 1 if the algorithm for that row had the maximum RSA
for the scenario tested and 0 otherwise.

The program genGraphsNoQuad.py outputs graphs from a CSV file.  To do so correctly, the parameter
BIN_SIZE must be equal to the bin size (0.1 or 0.2) listed in the CSV file name.

The remaining python programs simulate scheduling and output a CSV file such as those contained here.
We suggest you first run just a few scenarios with a small number of trials, such as 10; running even
one scenario with many trials can potentially take hours.